Research in Computing Science, Vol. 68, pp. 57-68, 2013.
Abstract: Dung established the connections between several logic programming semantics and various argumentation framework semantics. In this paper we present a characterization of the preferred semantics of argumentation frameworks (which is defined in terms of a maximal admissible set w.r.t. set inclusion) in terms of minimal logic models of Clark's completion. Additionally, we make use of integer programming for computing preferred extensions by a method defined by Bell et al., which translates a logic program into an integer program which in turn can be solved by an ad hoc solver.
Keywords: Argumentation frameworks, preferred extensions, Clark's completion semantics, answer set programming, integer programming.
PDF: Preferred Extensions as Minimal Models of Clark's Completion Semantics
PDF: Preferred Extensions as Minimal Models of Clark's Completion Semantics